13 while(n
-- && cin
>>bigint
){
14 printf("Case %d: ",cases
++);
17 for(int i
=0;i
<bigint
.size();++i
){
18 mod
=(mod
+(bigint
[i
]-'0')%3)%3;
19 if((bigint
[i
]-'0')%3==0) ++n3
;
23 for(int i
=0;i
<bigint
.size();++i
){
24 if((bigint
[i
]-'0')%3==mod
){
33 if(empiezan
) cout
<<winner
[n3
%2]<<endl
;